Discovery of Approximate Differential Dependencies
نویسندگان
چکیده
Differential dependencies (DDs) capture the relationships between data columns of relations. They are more general than functional dependencies (FDs) and and the difference is that DDs are defined on the distances between values of two tuples, not directly on the values. Because of this difference, the algorithms for discovering FDs from data find only special DDs, not all DDs and therefore are not applicable to DD discovery. In this paper, we propose an algorithm to discover DDs from data following the way of fixing the left hand side of a candidate DD to determine the right hand side. We also show some properties of DDs and conduct a comprehensive analysis on how sampling affects the DDs discovered from data. keywords: Differential dependencies, functional dependencies, dependency discovery, knowledge discovery, lattice, partition
منابع مشابه
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functional dependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional dependencies from large databases, based on partitioning the set of rows with respect to their attribute values. The use of partitions makes the discovery of approximate functional dependencies easy and efficient, an...
متن کاملDiscover Dependencies from Data - A Review
Functional and inclusion dependency discovery is important to knowledge discovery, database semantics analysis, database design, and data quality assessment. Motivated by the importance of dependency discovery, this paper reviews the methods for functional dependency, conditional functional dependency, approximate functional dependency and inclusion dependency discovery in relational databases ...
متن کاملEecient Discovery of Functional and Approximate Dependencies Using Partitions (extended Version)
متن کامل
Discovery of functional and approximate functional dependencies in relational databases
This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation’s row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on intege...
متن کاملAn Approximate Method for System of Nonlinear Volterra Integro-Differential Equations with Variable Coefficients
In this paper, we apply the differential transform (DT) method for finding approximate solution of the system of linear and nonlinear Volterra integro-differential equations with variable coefficients, especially of higher order. We also obtain an error bound for the approximate solution. Since, in this method the coefficients of Taylor series expansion of solution is obtained by a recurrence r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1309.3733 شماره
صفحات -
تاریخ انتشار 2013